Reasoning in Description Logic with Semantic Tableau Binary Trees
نویسنده
چکیده
An alternative version of the tableau decision making algorithm defined in the ”Handbook of Description Logics” (Baader et col.) is presented. It is a version of semi-decidable tableau formal system that corresponds with that one of first order logic and shares its semantic soundness and completeness. In examples the advantages of the transparent tree-style representation algorithm, comparing with the algorithm of the handbook, is demonstrated. It is shown that the tree representation of the tableau proof gives a possibility of transparent creation of models in the cases of direct tableau proofs. On the base of the properties of indirect tableau proofs is possible to define a dual Gentzen-like axiomatic system for direct generation of theories consisting of logical consequences of knowledge bases.
منابع مشابه
Reasoning with Semantic Tableau Binary Trees in Description Logic
Authors of the Handbook of Description Logic present tableaux algorithms by means of a collection of so-called completion rules intended to generate a completion of ABox with respect to a corresponding TBox of a knowledge base S. An approach we present here is slightly modified. We use a set S of DL formulas of a knowledge base Σ containing DL formulas of ABox and transcriptions of definitions ...
متن کاملExploring Parallelization of Conjunctive Branches in Tableau-Based Description Logic Reasoning
Multiprocessor equipment is cheap and ubiquitous now, but users of description logic (DL) reasoners have to face the awkward fact that the major tableau-based DL reasoners can make use only one of the available processors. Recently, researchers have started investigating how concurrent computing can play a role in tableau-based DL reasoning with the intention of fully exploiting the processing ...
متن کاملReasoning with Fuzzy Ontologies
By the development of Semantic Web, increasing demands for vague information representation have triggered a mass of theoretical and applied researches of fuzzy ontologies, whose main logical infrastructures are fuzzy description logics. However, current tableau algorithms can not supply complete reasoning support within fuzzy ontology: reasoning with general TBox is still a difficult problem i...
متن کاملTableau-Based ABox Abduction for Description Logics: Preliminary Report
ABox abduction is an important reasoning problem for description logics (DL) with applications in diagnosis, manufacturing control, multimedia interpretation, etc. Several abductive reasoners for DL were designed and implemented using a translation to first-order logic or logic programming. Algorithms for ABox abduction based directly on native DL reasoning techniques, such as tableau algorithm...
متن کاملAlgebraic tableau reasoning for the description logic SHOQ
Semantic web applications based on the web ontology language (OWL) often require the use of numbers in class descriptions for expressing cardinality restrictions on properties or even classes. Some of these cardinalities are specified explicitly but quite a few are entailed and need to be discovered by reasoning procedures. Due to the description logic (DL) foundation of OWL those reasoning ser...
متن کامل